Index theorems for graph-parametrized optimal control problems
نویسندگان
چکیده
In this paper we prove Morse index theorems for a big class of constrained variational problems on graphs. Such are useful in various physical and geometric applications. Our formulas compute the difference indices two Hessians related to different graphs or sets boundary conditions. Several applications such as iteration lower bounds proved.
منابع مشابه
Certified Reduced Basis Methods for Parametrized Distributed Optimal Control Problems∗
In this paper, we consider the efficient and reliable solution of distributed optimal control problems governed by parametrized elliptic partial differential equations. The reduced basis method is used as a low-dimensional surrogate model to solve the optimal control problem. To this end, we introduce reduced basis spaces not only for the state and adjoint variable but also for the distributed ...
متن کاملReduced Basis Method for Parametrized Elliptic Optimal Control Problems
We propose a suitable model reduction paradigm – the certified reduced basis method (RB) – for the rapid and reliable solution of parametrized optimal control problems governed by partial differential equations (PDEs). In particular, we develop the methodology for parametrized quadratic optimization problems with elliptic equations as constraint. Firstly, we recast the optimal control problem i...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملCertified Reduced Basis Methods for Parametrized Distributed Elliptic Optimal Control Problems with Control Constraints
In this paper, we employ the reduced basis method for the efficient and reliable solution of parametrized optimal control problems governed by scalar coercive elliptic partial differential equations. We consider the standard linear-quadratic problem setting with distributed control and unilateral control constraints. For this problem class, we propose two different reduced basis approximations ...
متن کاملGeneralized B-spline functions method for solving optimal control problems
In this paper we introduce a numerical approach that solves optimal control problems (OCPs) using collocation methods. This approach is based upon B-spline functions. The derivative matrices between any two families of B-spline functions are utilized to reduce the solution of OCPs to the solution of nonlinear optimization problems. Numerical experiments confirm our heoretical findings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2023
ISSN: ['0951-7715', '1361-6544']
DOI: https://doi.org/10.1088/1361-6544/acc5d4